The Effects of Modalities in Separation Logics (Extended Abstract)

نویسندگان

  • Stéphane Demri
  • Morgan Deters
چکیده

Like modal logic, temporal logic, or description logic, separation logic has become a popular class of logical formalisms in computer science, conceived as assertion languages for Hoare-style proof systems with the goal to perform automatic program analysis. We present similarities with modal and temporal logics, and we present landmark results about decidability, complexity and expressive power.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Effects of Modalities in Separation Logics

Like modal logic, temporal logic, or description logic, separation logic has become a popular class of logical formalisms in computer science, conceived as assertion languages for Hoare-style proof systems with the goal to perform automatic program analysis. We present similarities with modal and temporal logics, and we present landmark results about decidability, complexity and expressive power.

متن کامل

ar X iv : 1 30 7 . 55 92 v 4 [ cs . L O ] 2 6 N ov 2 01 3 Proof Search for Propositional Abstract Separation Logics via Labelled Sequents

Abstract separation logics are a family of extensions of Hoare logic for reasoning about programs that mutate memory. These logics are “abstract” because they are independent of any particular concrete memory model. Their assertion languages, called propositional abstract separation logics, extend the logic of (Boolean) Bunched Implications (BBI) in various ways. We develop a modular proof theo...

متن کامل

Separation logics and modalities: a survey

Like modal logic, temporal logic, or description logic, separation logic has become a popular class of logical formalisms in computer science, conceived as assertion languages for Hoarestyle proof systems with the goal to perform automatic program analysis. In a broad sense, separation logic is often understood as a programming language, an assertion language and a family of rules involving Hoa...

متن کامل

Decidability of Modular Logics for Concurrency

The modular logics we approach in this paper are logics for concurrent systems that reflect both behavioral and structural properties of systems. They combine dynamic modalities that express behavioural properties of a system with polyadic modalities that join properties of subsystems. Spatial and Separation Logics are examples of modular logics. Being the complex algebraic-coalgebraic semantic...

متن کامل

Blind Signal Separation Using an Extended Infomax Algorithm

The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014